Fault-tolerant Routing in Dual-cubes Based on Routing Probabilities
نویسندگان
چکیده
منابع مشابه
A Fault-Tolerant Routing Strategy for Fibonacci-Class Cubes
Fibonacci Cubes (FCs), together with the enhanced and extended forms, are a family of interconnection topologies formed by diluting links from binary hypercube. While they scale up more slowly, they provide more choices of network size. Despite sparser connectivity, they allow efficient emulation of many other topologies. However, there is no existing fault-tolerant routing strategy for FCs or ...
متن کاملBinomial-Tree Fault Tolerant Routing in Dual-Cubes with Large Number of Faulty Nodes
A dual-cube DC(m) has m + 1 links per node where m is the degree of a cluster (m-cube), and one extra link is used for connection between clusters. The dual-cube mitigates the problem of increasing number of links in the large-scale hypercube network while keeps most of the topological properties of the hypercube network. In this paper, we propose efficient algorithms for finding a nonfaulty ro...
متن کاملA Limited-Global Information Model for Fault-Tolerant Routing in Dual-Cubes
The binary hypercube has been widely used as the interconnection network in a variety of parallel systems such as Intel iPSC, SGI Origin 2000, nCUBE, and Connection Machine CM-2. To extend the hypercube network such that the size of the network can be increased with the limited number of links per node, Li [1] proposed a new interconnection network, called dual-cube. An r-connected dualcube con...
متن کاملProbability-based Fault-tolerant Routing in Hypercubes
This paper describes a new fault-tolerant routing algorithm for the hypercube, using the concept of probability vectors. To compute these vectors, a node first determines its faulty set, which represents the set of all its neighbouring nodes that are faulty or unreachable due to faulty nodes or links. Each node then calculates a probability vector, where the kth element represents the probabili...
متن کاملFault-tolerant Routing in Metacube
A new interconnection network with low-degree for very large parallel computers called metacube (MC) has been introduced recently. The MC network has short diameter similar to that of the hypercube. However, the degree of an MC network is much lower than that of a hypercube of the same size. More than one hundred of millions of nodes can be connected by an MC network with up to 6 links per node...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2015
ISSN: 1877-0509
DOI: 10.1016/j.procs.2015.10.007